Transfer Learning-Based Co-Run Scheduling for Heterogeneous Datacenters
نویسندگان
چکیده
Today’s data centers are designed with multi-core CPUs where multiple virtual machines (VMs) can be colocated into one physical machine or distribute multiple computing tasks onto one physical machine. The result is co-tenancy, resource sharing and competition. Modeling and predicting such co-run interference becomes crucial for job scheduling and Quality of Service assurance. Co-locating interference can be characterized into two components, sensitivity and pressure, where sensitivity characterizes how an application’s own performance is affected by a co-run application, and pressure characterizes how much contentiousness an application exerts/brings onto the memory subsystem. Previous studies show that with simple models, sensitivity and pressure can be accurately characterized for a single machine. We extend the models to consider crossarchitecture sensitivity (across different machines).
منابع مشابه
Web-Scale Job Scheduling
Web datacenters and clusters can be larger than the world’s largest supercomputers, and run workloads that are at least as heterogeneous and complex as their high-performance computing counterparts. And yet little is known about the unique job scheduling challenges of these environments. This article aims to ameliorate this situation. It discusses the challenges of running web infrastructure an...
متن کاملAn Improved Scheduling Strategy in Cloud Using Trust Based Mechanism
Cloud Computing refers to applications delivered as services over the internet, and the datacenters that provide those services with hardware and systems software. These were earlier referred to as Software as a Service (SaaS). Scheduling is justified by job components (called tasks), lack of information. In fact, in a large fraction of jobs from machine learning, bio-computing, and image proce...
متن کاملQoS-Aware Admission Control in Heterogeneous Datacenters
Large-scale datacenters (DCs) host tens of thousands of diverse applications each day. Apart from determining where to schedule workloads, the cluster manager should also decide when to constrain application admission to prevent system oversubscription. At the same time datacenter users care not only for fast execution time but for low waiting time (fast scheduling) as well. Recent work has add...
متن کاملPublic transport fleet scheduling for minimizing total transfer waiting time
Public transportation has been one of the most important research fields in the two last decades. The purpose of this paper is to create a schedule for public transport fleets such as buses and metro trains with the goal of minimizing the total transfer waiting time. We extend previous research works in the field of transit schedule with considering headways of each route as decision variables....
متن کاملData-Aware Scheduling in Datacenters
Title of dissertation: DATA-AWARE SCHEDULING IN DATACENTERS Manish Purohit, Doctor of Philosophy, 2016 Dissertation directed by: Professor Samir Khuller Department of Computer Science Datacenters have emerged as the dominant form of computing infrastructure over the last two decades. The tremendous increase in the requirements of data analysis has led to a proportional increase in power consump...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015